A Warm-start Interior-point Method for Predictive Control
نویسندگان
چکیده
In predictive control, a quadratic program (QP) needs to be solved at each sampling instant. We present a new warm-start strategy to solve a QP with an interior-point method whose data is slightly perturbed from the previous QP. In this strategy, an initial guess of the unknown variables in the perturbed problem is determined from the computed solution of the previous problem. We demonstrate the effectiveness of our warm-start strategy to a number of online benchmark problems. Numerical results indicate that the proposed technique depends upon the size of perturbation and it leads to a reduction of 30–74% in floating point operations compared to a cold-start interior-point method.
منابع مشابه
Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
We implement several warm-start strategies in interior-point methods for linear programming (LP). We study the situation in which both the original LP instance and the perturbed one have exactly the same dimensions. We consider different types of perturbations of data components of the original instance and different sizes of each type of perturbation. We modify the state-of-the-art interior-po...
متن کاملA decomposition-based warm-start method for stochastic programming
In this paper we propose a warm-start technique for interior point methods applicable to multi-stage stochastic programming problems. The main idea is to generate an initial point for the interior point solver by decomposing the barrier problem associated with the deterministic equivalent at the second stage and using a concatenation of the solutions of the subproblems as a starting point for t...
متن کاملSolving Real World Linear Ordering Problems Using a Primal Dual Interior Point Cutting Plane Method
Cutting plane methods require the solution of a sequence of linear programs where the solution to one provides a warm start to the next A cutting plane algorithm for solving the linear ordering problem is described This algorithm uses the primal dual interior point method to solve the linear programming relaxations A point which is a good warm start for a simplex based cutting plane algorithm i...
متن کاملWarm-Start Strategies in Interior-Point Methods for Linear Programming
We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbed from the original. We describe strategies for recovering a \warm-start" point for the perturbed problem instance from the iterates of the original problem instance. We obtain worst-case estimates of the number of iterations r...
متن کاملA decomposition-based crash-start for stochastic programming
In this paper we propose a crash-start technique for interior point methods applicable to multi-stage stochastic programming problems. The main idea is to generate an initial point for the interior point solver by decomposing the barrier problem associated with the deterministic equivalent at the second stage and using a concatenation of the solutions of the subproblems as a warm-starting point...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010